MixedAD: A Scalable Algorithm for Detecting Mixed Anomalies in Attributed Graphs
نویسندگان
چکیده
منابع مشابه
Uncovering Interesting Attributed Anomalies in Large Graphs
Uncovering Interesting Attributed Anomalies in Large Graphs Nan Li Graph is a fundamental model for capturing entities and their relations in a wide range of applications. Examples of real-world graphs include the Web, social networks, communication networks, intrusion networks, collaboration networks, and biological networks. In recent years, with the proliferation of rich information availabl...
متن کاملSymbolic Attributed Graphs for Attributed Graph Transformation
In this paper we present a new approach to deal with attributed graphs and attributed graph transformation. This approach is based on working with what we call symbolic graphs, which are graphs labelled with variables together with a formula that constrains the possible values that we may assign to these variables. In particular, in this paper we will compare in detail this new approach with th...
متن کاملAn Algorithm for Detecting Intrinsically Knotted Graphs
We describe an algorithm that recognizes seemingly most — possibly all — intrinsically knotted (IK) graphs, and can help find knotless embeddings for graphs that are not IK. The algorithm, implemented as a Mathematica program, has already been used in [6] to greatly expand the list of known minor minimal IK graphs, and to find knotless embeddings for some graphs that had previously resisted att...
متن کاملA Fast Kernel for Attributed Graphs
As a fundamental technique for graph analysis, graph kernels have been successfully applied to a wide range of problems. Unfortunately, the high computational complexity of existing graph kernels is limiting their further applications to larger-scale graph datasets. In this paper, we propose a fast graph kernel, the descriptor matching (DM) kernel, for graphs with both categorical and numerical...
متن کاملBorrowed Contexts for Attributed Graphs
Borrowed context graph transformation is a simple and powerful technique developed by Ehrig and König that allow us to derive labeled transitions and bisimulation congruences for graph transformation systems or, in general, for process calculi that can be defined in terms of graph transformation systems. Moreover, the same authors have also shown how to use this technique for the verification o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the AAAI Conference on Artificial Intelligence
سال: 2020
ISSN: 2374-3468,2159-5399
DOI: 10.1609/aaai.v34i01.5482